Computing the Isolated Roots by Matrix Methods
نویسندگان
چکیده
منابع مشابه
Computing the Isolated Roots by Matrix Methods
Two main approaches are used, nowadays, to compute the roots of a zero-dimensional polynomial system. The first one involves Gröbner basis computation, and applies to any zero-dimensional system. But, it is performed with exact arithmetic and, usually, large numbers appear during the computation. The other approach is based on resultant formulations and can be performed with floating point arit...
متن کاملComputing the additive degree-Kirchhoff index with the Laplacian matrix
For any simple connected undirected graph, it is well known that the Kirchhoff and multiplicative degree-Kirchhoff indices can be computed using the Laplacian matrix. We show that the same is true for the additive degree-Kirchhoff index and give a compact Matlab program that computes all three Kirchhoffian indices with the Laplacian matrix as the only input.
متن کاملOn computing Bézier curves by Pascal matrix methods
The main goal of the paper is to introduce methods which compute Bézier curves faster than Casteljau’s method does. These methods are based on the spectral factorization of a n×n Bernstein matrix, B n(s) = PnGn(s)P −1 n , where Pn is the n×n lower triangular Pascal matrix. So we first calculate the exact optimum positive value t in order to transform Pn in a scaled Toeplitz matrix, which is a p...
متن کاملA Schur Algorithm for Computing Matrix pth Roots
Any nonsingular matrix has pth roots. One way to compute matrix pth roots is via a specialized version of Newton’s method, but this iteration has poor convergence and stability properties in general. A Schur algorithm for computing a matrix pth root that generalizes methods of Björck and Hammarling [Linear Algebra Appl., 52/53 (1983), pp. 127–140] and Higham [Linear Algebra Appl., 88/89 (1987),...
متن کاملComputing Iterative Roots with Second Order Training Methods
Iterative roots are a valuable tool for modeling and analyzing dynamical systems. They provide a natural way to construct a continuous time model from discrete time data. However, they are in most cases extremely difficult to compute analytically. Previously we have demonstrated how to use neural networks to calculate the iterative roots and fractional iterations of functions. We used a special...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1998
ISSN: 0747-7171
DOI: 10.1006/jsco.1998.0236